Justification and Defeat

نویسنده

  • John L. Pollock
چکیده

This paper exhibits some problematic cases of defeasible or nonmonotonic reasoning that tend to be handled incorrectly by all of the theories of defeasible and nonmonotonic reasoning in the current literature. The paper focuses particularly on default logic, circumscription, and the author’s own argument-based approach to defeasible reasoning. A proposal is made for how to deal with these problematic cases. The paper closes with a demonstration that the proposed solution is able to differentiate, in a congenial way, between cases having the structure of the lottery paradox and cases having the structure of the paradox of the preface. The algorithm proposed for computing justificational status has been implemented in the automated defeasible reasoner OSCAR.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degrees of Justification

The question addressed in this paper is how the degree of justification of a belief is determined. A conclusion may be supported by several different arguments, the arguments typically being defeasible, and there may also be arguments of varying strengths for defeaters for some of the supporting arguments. What is sought is a way of computing the “on sum” degree of justification of a conclusion...

متن کامل

Defeasible reasoning with variable degrees of justification

The question addressed in this paper is how the degree of justification of a belief is determined. A conclusion may be supported by several different arguments, the arguments typically being defeasible, and there may also be arguments of varying strengths for defeaters for some of the supporting arguments. What is sought is a way of computing the “on sum” degree of justification of a conclusion...

متن کامل

Deflog -a Logic of Dialectical Justification and Defeat

....................................................................................................................................................... 2

متن کامل

A Rgue ! - an Implemented System for Computer - Mediated Defeasible

This paper introduces the Argue!-system. It is an example of a system for computer-mediated defeasible argumentation, a new trend in the field of defeasible argumentation. In this research, computer systems are developed that can be used to mediate the process of argumentation of one or more users. Argument-mediation systems should be contrasted with systems for automated reasoning: the latter ...

متن کامل

Pollock and Sturgeon on defeaters

Scott Sturgeon has recently challenged Pollock’s account of undercutting defeaters. The challenge involves three primary contentions: (1) the account is both too strong and too weak, (2) undercutting defeaters exercise their power to defeat only in conjunction with higher-order beliefs about the basis of the lower-order beliefs whose justification they target, and (3) since rebutting defeaters ...

متن کامل

An analysis of critical-link semantics with variable degrees of justification

This paper is to critically examines Pollock’s critical-link semantics with variable degrees of justification. Some possibly counterintuitive consequences of Pollock’s definition of degrees of justification are identified and a modified definition is proposed which avoids these consequences. Then the new solution is applied to the case of so-called presumptive defeat. A second contribution of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Artif. Intell.

دوره 67  شماره 

صفحات  -

تاریخ انتشار 1994